#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e3+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],sum[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
     LL n;cin>>n;
     for(LL i=0;i<n+10;i++) sum[i]=0;
     for(LL i=1;i<=n;i++){
         cin>>a[i];
     }
     for(LL i=1;i<=n;i++) sum[i]=sum[i-1]^a[i];
     bool flag=0;
     for(LL i=1;i<=n;i++){
        for(LL j=i+1;j<=n;j++){
            if( ( sum[i]^( sum[j]^sum[i] ) )==( (sum[n]^sum[j])^(sum[j]^sum[i-1])) ){
                flag=1;
            }
        }
     }
     if(flag){
        cout<<"YES"<<"\n";
     }
     else{
        cout<<"NO"<<"\n";
     }
   }
   return 0;
}
